The logic of message passing

نویسندگان

  • J. Robin B. Cockett
  • Craig A. Pastro
چکیده

Message passing is a key ingredient of concurrent programming. The purpose of this paper is to describe the equivalence between the proof theory, the categorical semantics, and term calculus of message passing. In order to achieve this we introduce the categorical notion of a linear actegory and the related polycategorical notion of a poly-actegory. Not surprisingly the notation used for the term calculus borrows heavily from the (synchronous) πcalculus. The cut elimination procedure for the system provides an operational semantics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Message Passing Logic

Message passing is a key ingredient of concurrent programming. The purpose of this paper is to describe the equivalence between the proof theory, the categorical semantics, and term calculus of message passing. In order to achieve this we introduce the categorical notion of a linear actegory and the related polycategorical notion of a poly-actegory. Not surprisingly the notation used for the te...

متن کامل

Can Message Buffers Be Axiomatized in Linear Temporal Logic?

Message passing is one of the primary modes of interprocess communication in a distributed system. In this paper we investigate the possibility of characterizing and axiomatizing different message passing systems in temporal logic. Specifically, we consider FIFO buffers (queues), LIFO buffers (stacks) and unordered buffers (bags). We show that all bounded buffers are characterizable in proposit...

متن کامل

Memory Centric Interconnection Mechanism for Message Passing in Parallel Systems

The Interconnection Network (IN) connecting computing nodes in parallel systems has become one of the key research issues in parallel computer architecture. Traditionally, the INs in parallel systems for message passing have been built on the basis of logic circuits with different topology structures. Currently, the bandwidth of data transmission for message passing in available parallel system...

متن کامل

Message-Passing Automata Are Expressively Equivalent to EMSO Logic

We study the expressiveness of finite message-passing automata with a priori unbounded channels and show them to capture exactly the class of MSC languages that are definable in existential monadic second-order logic interpreted over MSCs. Moreover, we prove the monadic quantifier-alternation hierarchy over MSCs to be infinite and conclude that the class of MSC languages accepted by message-pas...

متن کامل

A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems

We investigate quantified interpreted systems, a semantics to model multi-agent systems in which agents can reason about individuals, their properties, and relationships among them. The semantics naturally extends interpreted systems to first-order by introducing a domain of individuals. We analyse a first-order epistemic language interpreted on this semantics and show soundness and completenes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Sci. Comput. Program.

دوره 74  شماره 

صفحات  -

تاریخ انتشار 2009